#define _CRT_SECURE_NO_WARNINGS 1
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
	TreeNode* insertIntoBST(TreeNode* root, int val) {
		if (root == nullptr)
		{
			TreeNode* node = new TreeNode(val);
			return node;
		}

		if (root->val < val)
		{
			root->right = insertIntoBST(root->right, val);
		}
		if (root->val > val)
		{
			root->left = insertIntoBST(root->left, val);
		}

		return root;
	}
};